A New Distance Measure for Model-Based Sequence Clustering
نویسندگان
چکیده
منابع مشابه
K Modes Clustering Algorithm Based on a New Distance Measure
T he leading par tit ional clustering technique, K Modes, is one of the most computationally eff icient clustering methods fo r categ orical data. In the t raditional K Modes algo rithm, the simple matching dissim ilarity measure is used to compute the distance betw een two values of the same catego rical at t ributes. T his compares tw o categorical v alues directly and results in either a dif...
متن کاملOntology-based Distance Measure for Text Clustering
Recent work has shown that ontologies are useful to improve the performance of text clustering. In this paper, we present a new clustering scheme on the basis of ontologies-based distance measure. Before implementing clustering process, term mutual information matrix is calculated with the aid of Wordnet and some methods of learning ontologies from textual data. Combining this mutual informatio...
متن کاملA new Mahalanobis distance measure for clustering of fiber tracts
INTRODUCTION Data analysis in Diffusion Tensor Magnetic Resonance Imaging (DT-MRI) is highly sophisticated and can be thought of as a “pipeline” of closely connected processing and modeling steps. Cluster analysis of the orientation of the fiber direction and fiber tracts is typically carried on the major eigenvector. This type of cluster analysis is also important in reducing sorting bias in t...
متن کاملA new sequence distance measure for phylogenetic tree construction
MOTIVATION Most existing approaches for phylogenetic inference use multiple alignment of sequences and assume some sort of an evolutionary model. The multiple alignment strategy does not work for all types of data, e.g. whole genome phylogeny, and the evolutionary models may not always be correct. We propose a new sequence distance measure based on the relative information between the sequences...
متن کاملA Model-Based Distance for Clustering
A Riemannian distance is defined which is appropriate for clustering multivariate data. This distance requires that data is first fitted with a differentiable density model allowing the definition of an appropriate Riemannian metric. A tractable approximation is developed for the case of a Gaussian mixture model and the distance is tested on artificial data, demonstrating an ability to deal wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2009
ISSN: 0162-8828
DOI: 10.1109/tpami.2008.268